No-feedback card guessing for dovetail shuffles
نویسندگان
چکیده
منابع مشابه
No-feedback Card Guessing for Dovetail Shuffles
We consider the following problem. A deck of 2n cards labeled consecutively from 1 on top to 2n on bottom is face down on the table. The deck is given k dovetail shuues and placed back on the table, face down. A guesser tries to guess at the cards one at a time, starting from top. The identity of the card guessed at is not revealed, nor is the guesser told whether a particular guess was correct...
متن کاملCard-based protocols using unequal division shuffles
Card-based cryptographic protocols can perform secure computation of Boolean functions. In 2013, Cheung et al. presented a protocol that securely produces a hidden AND value using five cards; however, it fails with a probability of 1/2. The protocol uses an unconventional shuffle operation called an unequal division shuffle; after a sequence of five cards is divided into a two-card portion and ...
متن کاملA Simple Card Guessing Game Revisited
A deck of cards consisting of m red and n black cards is given. A guess is made as to the colour of the top card, after which it is revealed and discarded. To maximise the number of correct guesses one chooses the colour corresponding to the majority of cards remaining in the deck. We determine the expected number of correct guesses with this strategy, as well as the probability of beating an o...
متن کاملThe Impact of Correction for Guessing Formula on MC and Yes/No Vocabulary Tests' Scores
A standard correction for random guessing (cfg) formula on multiple-choice and Yes/Noexaminations was examined retrospectively in the scores of the intermediate female EFL learners in an English language school. The correctionwas a weighting formula for points awarded for correct answers,incorrect answers, and unanswered questions so that the expectedvalue of the increase in test score due to g...
متن کاملOptimal Guessing Strategies in a Quantum Card Game
Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know better than Alice does on guessing Alice’s card, no matter what Bob chooses to measure his two cards collectively or separately. We also find that Bob’s best st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1998
ISSN: 1050-5164
DOI: 10.1214/aoap/1028903379